State space partitioning based on constrained spectral clustering for block particle filtering
نویسندگان
چکیده
To overcome the curse of dimensionality particle filter (PF), block PF (BPF) partitions state space into several blocks smaller dimension so that correction and resampling steps can be performed independently on each block. Despite its potential performance, this approach has a practical limitation. BPF requires an additional input compared to classical PF: partition from which are defined. A poor choice will not offer expected performance gain. In paper, we formulate partitioning problem as clustering propose data-driven method based constrained spectral (CSC) automatically provide appropriate partition. We design generalized contains two new steps: (i) estimation vector correlation matrix particles, (ii) CSC using estimate determine blocks. The proposed succeeds in providing online restricted size grouping most correlated variables. This allows escape by reducing variance filtering distribution while limiting level bias. Since our relies particles already necessary generate part BPF, computation overhead is limited.
منابع مشابه
Particle filtering for EEG source localization and constrained state spaces
...........................................................................................................................v List of Figures ..................................................................................................................viii List of Tables ...................................................................................................................x Chapt...
متن کاملGaussian sum particle filtering for dynamic state space models
For dynamic systems, sequential Bayesian estimation requires updating of the filtering and predictive densities. For nonlinear and non-Gaussian models, sequential updating is not as straightforward as in the linear Gaussian model. In this paper, densities are approximated as finite mixture models as is done in the Gaussian sum filter. A novel method is presented, whereby sequential updating of ...
متن کاملConstrained 1-Spectral Clustering
An important form of prior information in clustering comes in form of cannot-link and must-link constraints. We present a generalization of the popular spectral clustering technique which integrates such constraints. Motivated by the recently proposed 1-spectral clustering for the unconstrained problem, our method is based on a tight relaxation of the constrained normalized cut into a continuou...
متن کاملSpectral Clustering by Recursive Partitioning
In this paper, we analyze the second eigenvector technique of spectral partitioning on the planted partition random graph model, by constructing a recursive algorithm using the second eigenvectors in order to learn the planted partitions. The correctness of our algorithm is not based on the ratio-cut interpretation of the second eigenvector, but exploits instead the stability of the eigenvector...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing
سال: 2022
ISSN: ['0165-1684', '1872-7557']
DOI: https://doi.org/10.1016/j.sigpro.2022.108727